A Framework for Dynamic Graph
نویسندگان
چکیده
Drawing graphs is an important problem that combines avors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows: We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. We present several eecient dynamic drawing algorithms for trees, series-parallel digraphs, planar st-digraphs, and planar graphs. These algorithms adopt a variety of representations (e.g., straight-line, polyline, visibility), and update the drawing in a smooth way.
منابع مشابه
A Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملA Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping node problem, large graph layout and dynamic graph layout. In order to solve these problems, this paper aims to systematically address algorithmic issues related to a novel framework that describes the process of graph ...
متن کاملImage Retrieval Using Dynamic Weighting of Compressed High Level Features Framework with LER Matrix
In this article, a fabulous method for database retrieval is proposed. The multi-resolution modified wavelet transform for each of image is computed and the standard deviation and average are utilized as the textural features. Then, the proposed modified bit-based color histogram and edge detectors were utilized to define the high level features. A feedback-based dynamic weighting of shap...
متن کاملA time-dependent vehicle routing problem for disaster response phase in multi-graph-based network
Logistics planning in disaster response phase involves dispatching commodities such as medical materials, personnel, food, etc. to affected areas as soon as possible to accelerate the relief operations. Since transportation vehicles in disaster situations can be considered as scarce resources, thus, the efficient usage of them is substantially important. In this study, we provide a dynamic vehi...
متن کاملAlternative ranking method in Dynamic Data Envelopment Analysis (DDEA)
The motivation of this paper is to propose such equitable method for ranking all decision making units (DMUs) in dynamic Data Envelopment Analysis (DDEA) framework. As far as we are aware there is not more studies in dynamic DEA literature. What's more, in such cases the best operating unit is important to be sampled for the others in under evaluated time periods. However, in this special conce...
متن کاملDynamic network analyzer building a framework for the graph-theoretic analysis of dynamic networks
With the rise of online social networks and other highly dynamic system, the need for the analysis of their structural properties has grown in the last years. While the recomputation of graph-theoretic metrics is feasible for investigating a small set of static system snapshots, this approach is unfit for the application in highly dynamic systems where we aim at frequent property updates. Based...
متن کامل